The Many Valued and Nonmonotonic Turn in Logic
ثبت نشده
چکیده
Description: The present volume of the Handbook of the History of Logic brings together two of the most important developments in 20th century non-classical logic. These are many-valuedness and non-monotonicity. On the one approach, in deference to vagueness, temporal or quantum indeterminacy or reference-failure, sentences that are classically non-bivalent are allowed as inputs and outputs to consequence relations. Many-valued, dialetheic, fuzzy and quantum logics are, among other things, principled attempts to regulate the flow-through of sentences that are neither true nor false. On the second, or non-monotonic, approach, constraints are placed on inputs (and sometimes on outputs) of a classical consequence relation, with a view to producing a notion of consequence that serves in a more realistic way the requirements of real-life inference.
منابع مشابه
Truth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملTwo-Valued Logic Programs
We define a nonmonotonic formalism that shares some features with three other systems of nonmonotonic reasoning—default logic, logic programming with strong negation, and nonmonotonic causal logic—and study its possibilities as a language for describing actions. 1998 ACM Subject Classification D.1.6 Logic Programming
متن کاملSemantics-based Nonmonotonic Inference
In this paper we discuss Gabbay’s idea of basing nonmonotonic deduction on semantic consequence in intuitionistic logic extended by a consistency operator and Turner’s suggestion of replacing the intuitionistic base system by Kleene’s three-valued logic. It is shown that a certain counterintuitive feature of these approaches can be avoided by using Nelson’s constructive logic N instead of intui...
متن کاملTREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS
In this paper, at first we define the concepts of response function and accessible states of a complete residuated lattice-valued (for simplicity we write $mathcal{L}$-valued) tree automaton with a threshold $c.$ Then, related to these concepts, we prove some lemmas and theorems that are applied in considering some decision problems such as finiteness-value and emptiness-value of recognizable t...
متن کاملAlternating Regular Tree Grammars in the Framework of Lattice-Valued Logic
In this paper, two different ways of introducing alternation for lattice-valued (referred to as {L}valued) regular tree grammars and {L}valued top-down tree automata are compared. One is the way which defines the alternating regular tree grammar, i.e., alternation is governed by the non-terminals of the grammar and the other is the way which combines state with alternation. The first way is ta...
متن کامل